Transport and percolation theory in weighted networks.

We study the distribution P(sigma) of the equivalent conductance sigma for Erdös-Rényi (ER) and scale-free (SF) weighted resistor networks with N nodes. Each link has conductance g triple bond e-ax, where x is a random number taken from a uniform distribution between 0 and 1 and the parameter a represents the strength of the disorder. We provide an iterative fast algorithm to obtain P(sigma) and compare it with the traditional algorithm of solving Kirchhoff equations. We find, both analytically and numerically, that P(sigma) for ER networks exhibits two regimes: (i) A low conductance regime for sigmae-apc in which we find that P(sigma) has strong N dependence and scales as P(sigma) approximately f(sigma,apc/N1/3) . For SF networks with degree distribution P(k) approximately k-lambda, kmin<or=k<or=kmax, we find numerically also two regimes, similar to those found for ER networks.